Are covering (enveloping) morphisms minimal?
نویسندگان
چکیده
منابع مشابه
Covering Morphisms in Categories of Relational Algebras
In this paper we use Janelidze’s approach to the classical theory of topological coverings via categorical Galois theory to study coverings in categories of relational algebras. Moreover, we present characterizations of effective descent morphisms in the categories of M ordered sets and of multi-ordered sets.
متن کاملCYCLIC COVERING MORPHISMS ON M0,n
We study cyclic covering morphisms from M0,n to moduli spaces of unpointed stable curves of positive genus or compactified moduli spaces of principally polarized abelian varieties. Our main application is a construction of new semipositive vector bundles and nef divisors on M0,n, with a view toward the F-conjecture. In particular, we construct new extremal rays of Nef(M0,n/Sn). We also find an ...
متن کاملCovering morphisms of crossed complexes and of cubical omega-groupoids are closed under tensor product
The aim is the theorems of the title and the corollary that the tensor product of two free crossed resolutions of groups or groupoids is also a free crossed resolution of the product group or groupoid. The route to this corollary is through the equivalence of the category of crossed complexes with that of cubical ω-groupoids with connections where the initial definition of the tensor product li...
متن کاملComputing the minimal covering set
We present the first polynomial-time algorithm for computing the minimal covering set of a (weak) tournament. The algorithm is based on a linear programming formulation of a subset of the minimal covering set known as the essential set. On the other hand, we show that no efficient algorithm exists for two variants of the minimal covering set, the minimal upward covering set and the minimal down...
متن کاملMinimal Logical Constraint Covering Sets
We propose a general framework for computing minimal set covers under class of certain logical constraints. The underlying idea is to transform the problem into a mathematical programm under linear constraints. In this sense it can be seen as a natural extension of the vector quantization algorithm proposed by [5]. We show which class of logical constraints can be cast and relaxed into linear c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the American Mathematical Society
سال: 2000
ISSN: 0002-9939
DOI: 10.1090/s0002-9939-00-05339-9